A sequent calculus with procedure calls
نویسندگان
چکیده
In this paper, we extend the sequent calculus LKF [LM09] into a calculus LK(T ), allowing calls to a decision procedure. We prove cut-elimination of LK(T ).
منابع مشابه
Sequent Calculi with procedure calls
In this paper, we introduce two focussed sequent calculi, LK(T ) and LK(T ), that are based on Miller-Liang’s LKF system [LM09] for polarised classical logic. The novelty is that those sequent calculi integrate the possibility to call a decision procedure for some background theory T , and the possibility to polarise literals "on the fly" during proof-search. These features are used in other wo...
متن کاملAction Systems with Synchronous Communication
The action system framework for modelling parallel and reactive programs is extended by adding procedure declarations to action systems. This permits remote procedure calls to be modelled within the framework. Synchronous message passing communication, being a special case of remote procedure calls, can therefore also be handled within this framework. This extension is done almost at no extra c...
متن کاملA Verification System for Distributed Objects with Asynchronous Method Calls
We present a verification system for Creol, an object-oriented modeling language for concurrent distributed applications. The system is an instance of KeY, a framework for object-oriented software verification, which has so far been applied foremost to sequential Java. Building on KeY characteristic concepts, like dynamic logic, sequent calculus, explicit substitutions, and the taclet rule lang...
متن کاملOn a Local-Step Cut-Elimination Procedure for the Intuitionistic Sequent Calculus
In this paper we investigate, for intuitionistic implicational logic, the relationship between normalization in natural deduction and cut-elimination in a standard sequent calculus. First we identify a subset of proofs in the sequent calculus that correspond to proofs in natural deduction. Then we define a reduction relation on those proofs that exactly corresponds to normalization in natural d...
متن کاملCut-Simulation and Impredicativity
We investigate cut-elimination and cut-simulation in impredicative (higherorder) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus for an impredicative logic — in our case a sequent calculus for classical type theory — is like adding cut. The phenomenon equally applies to prominent axioms like Booleanand functional extensionality, induction, choice, and des...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1204.5156 شماره
صفحات -
تاریخ انتشار 2012